Formalization of the Two-Step Approach to Overcomplete BSS
نویسندگان
چکیده
We discuss overcomplete blind source separation (BSS), that is separation with more sources than sensors. Finding the mixing matrix solves the linear quadratic BSS problem; in overcomplete BSS however, it is then still not clear and not even unique how to get the sources from the mixtures and the mixing matrix. We therefore follow Bofill and Zibulevsky in [5] and many others and take a two-step approach to overcomplete BSS: In the first so called blind mixing model recovery (BMMR) step, the mixing model has to be reconstructed from the mixtures in the linear case this would mean finding the mixing matrix. Then, in the blind source recovery (BSR) step, the sources have to be reconstructed given the mixing matrix and the mixtures. We furthermore introduce some notation and sayings and describe the usual BSR step in order to enable forthcoming overcomplete BSS papers to concentrate on one of the two steps, mainly on the BMMR step. Finally, we prove that the shortest-path algorithm as proposed by Bofill and Zibulevsky in [5] indeed solves the maximum-likelihood conditions in the BSR step.
منابع مشابه
Hierarchical clustering applied to overcomplete BSS for convolutive mixtures
In this paper we address the problem of overcomplete BSS for convolutive mixtures following a two-step approach. In the first step the mixing matrix is estimated, which is then used to separate the signals in the second step. For estimating the mixing matrix we propose an algorithm based on hierarchical clustering, assuming that the source signals are sufficiently sparse. It has the advantage o...
متن کاملA Histogram-based Overcomplete Ica Algorithm
Overcomplete blind source separation (BSS) tries to recover more sources from less sensor signals. We present a new approach based on an estimated histogram of the sensor data; we search for the points fulfilling the overcomplete Geometric Convergence Condition, which has been shown to be a limit condition of overcomplete geometric BSS [1]. The paper concludes with an example and a comparison o...
متن کاملOvercomplete BSS with a Geometric Algorithm
We present an independent component analysis (ICA) algorithm based on geometric considerations [10] [11] to decompose a linear mixture of more sources than sensor signals. Bofill and Zibulevsky [2] recently proposed a two-step approach for the separation: first learn the mixing matrix, then recover the sources using a maximum-likelihood approach. We present an efficient method for the matrix-re...
متن کاملOvercomplete BSS for Convolutive Mixtures Based on Hierarchical Clustering
In this paper we address the problem of overcomplete BSS for convolutive mixtures following a two-step approach. In the first step the mixing matrix is estimated, which is then used to separate the signals in the second step. For estimating the mixing matrix we propose an algorithm based on hierarchical clustering, assuming that the source signals are sufficiently sparse. It has the advantage o...
متن کاملSparse Representation and Its Applications in Blind Source Separation
In this paper, sparse representation (factorization) of a data matrix is first discussed. An overcomplete basis matrix is estimated by using the K−means method. We have proved that for the estimated overcomplete basis matrix, the sparse solution (coefficient matrix) with minimum l−norm is unique with probability of one, which can be obtained using a linear programming algorithm. The comparisons...
متن کامل